HOME

TheInfoList



OR:

In
mathematical analysis Analysis is the branch of mathematics dealing with continuous functions, limit (mathematics), limits, and related theories, such as Derivative, differentiation, Integral, integration, measure (mathematics), measure, infinite sequences, series ( ...
, the Minkowski inequality establishes that the L''p'' spaces satisfy 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 Degeneracy (mathematics)#T ...
in the definition of
normed vector space The Ateliers et Chantiers de France (ACF, Workshops and Shipyards of France) was a major shipyard that was established in Dunkirk, France, in 1898. The shipyard boomed in the period before World War I (1914–18), but struggled in the inter-war ...
s. The inequality is named after the German mathematician
Hermann Minkowski Hermann Minkowski (22 June 1864 – 12 January 1909) was a mathematician and professor at the University of Königsberg, the University of Zürich, and the University of Göttingen, described variously as German, Polish, Lithuanian-German, o ...
. 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 1 \leq p \leq \infty and let f and g be elements of L^p(S). Then f + g is in L^p(S), and we have the triangle inequality \, f+g\, _p \leq \, f\, _p + \, g\, _p with equality for 1 < p < \infty 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 exists no nontrivial linear combination of the vectors that equals the zero vector. If such a linear combination exists, then the vectors are said to be . These concepts ...
; that is, f = \lambda g for some \lambda \geq 0 or g = 0. Here, the norm is given by: \, f\, _p = \left(\int , f, ^p d\mu\right)^ if p < \infty, or in the case p = \infty 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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, 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 infinit ...
: \biggl(\sum_^n , x_k + y_k, ^p\biggr)^ \leq \biggl(\sum_^n , x_k, ^p\biggr)^ + \biggl(\sum_^n , y_k, ^p\biggr)^ for all real (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, \dots, x_n, y_1, \dots, y_n and where n is the
cardinality The thumb is the first digit of the hand, next to the index finger. When a person is standing in the medical anatomical position (where the palm is facing to the front), the thumb is the outermost digit. The Medical Latin English noun for thum ...
of S (the number of elements in S). In probabilistic terms, given the
probability space In probability theory, a probability space or a probability triple (\Omega, \mathcal, P) is a mathematical construct that provides a formal model of a random process or "experiment". For example, one can define a probability space which models ...
(\Omega, \mathcal, \mathbb), and \mathbb denote the expectation operator for every real- or complex-valued
random variable A random variable (also called random quantity, aleatory variable, or stochastic variable) is a Mathematics, mathematical formalization of a quantity or object which depends on randomness, random events. The term 'random variable' in its mathema ...
s X and Y on \Omega, Minkowski's inequality reads :\left(\mathbb , X, ^pright)^ + \left(\mathbb f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>X + Y, ^pright)^ \leqslant \left(\mathbb , X, ^pright)^ + \left(\mathbb f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>X + Y, ^pright)^ \leqslant \left(\mathbb , X, ^pright)^ + \left(\mathbb f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>X + Y, ^pright)^ \leqslant \left(\mathbb , X, ^pright)^ + \left(\mathbb f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>X + Y, ^pright)^ \leqslant \left(\mathbb , X, ^pright)^ + \left(\mathbb f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>X + Y, ^pright)^ \leqslant \left(\mathbb , X, ^pright)^ + \left(\mathbb f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>X + Y, ^pright)^ \leqslant \left(\mathbb , X, ^pright)^ + \left(\mathbb f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>X + Y, ^pright)^ \leqslant \left(\mathbb , X, ^pright)^ + \left(\mathbb f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>X + Y, ^pright)^ \leqslant \left(\mathbb , X, ^pright)^ + \left(\mathbb f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>X + Y, ^pright)^ \leqslant \left(\mathbb , X, ^pright)^ + \left(\mathbb f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>X + Y, ^pright)^ \leqslant \left(\mathbb , X, ^pright)^ + \left(\mathbb f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>X + Y, ^pright)^ \leqslant \left(\mathbb , X, ^pright)^ + \left(\mathbb f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>X + Y, ^pright)^ \leqslant \left(\mathbb , X, ^pright)^ + \left(\mathbb f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>X + Y, ^pright)^ \leqslant \left(\mathbb , X, ^pright)^ + \left(\mathbb f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>X + Y, ^pright)^ \leqslant \left(\mathbb , X, ^pright)^ + \left(\mathbb f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>X + Y, ^pright)^ \leqslant \left(\mathbb , X, ^pright)^ + \left(\mathbb f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>X + Y, ^pright)^ \leqslant \left(\mathbb , X, ^pright)^ + \left(\mathbb f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>X + Y, ^pright)^ \leqslant \left(\mathbb , X, ^pright)^ + \left(\mathbb f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>X + Y, ^pright)^ \leqslant \left(\mathbb , X, ^pright)^ + \left(\mathbb f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>X + Y, ^pright)^ \leqslant \left(\mathbb , X, ^pright)^ + \left(\mathbb f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>X + Y, ^pright)^ \leqslant \left(\mathbb , X, ^pright)^ + \left(\mathbb f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>X + Y, ^pright)^ \leqslant \left(\mathbb , X, ^pright)^ + \left(\mathbb f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>X + Y, ^pright)^ \leqslant \left(\mathbb , X, ^pright)^ + \left(\mathbb f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>X + Y, ^pright)^ \leqslant \left(\mathbb , X, ^pright)^ + \left(\mathbb f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>X + Y, ^pright)^ \leqslant \left(\mathbb , X, ^pright)^ + \left(\mathbb f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>X + Y, ^pright)^ \leqslant \left(\mathbb , X, ^pright)^ + \left(\mathbb f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>X + Y, ^pright)^ \leqslant \left(\mathbb , X, ^pright)^ + \left(\mathbb f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>X + Y, ^pright)^ \leqslant \left(\mathbb , X, ^pright)^ + \left(\mathbb f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>X + Y, ^pright)^ \leqslant \left(\mathbb , X, ^pright)^ + \left(\mathbb f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>X + Y, ^pright)^ \leqslant \left(\mathbb , X, ^pright)^ + \left(\mathbb f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>X + Y, ^pright)^ \leqslant \left(\mathbb , X, ^pright)^ + \left(\mathbb f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>X + Y, ^pright)^ \leqslant \left(\mathbb , X, ^pright)^ + \left(\mathbb f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>X + Y, ^pright)^ \leqslant \left(\mathbb , X, ^pright)^ + \left(\mathbb f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>X + Y, ^pright)^ \leqslant \left(\mathbb , X, ^pright)^ + \left(\mathbb f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>X + Y, ^pright)^ \leqslant \left(\mathbb , X, ^pright)^ + \left(\mathbb f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>X + Y, ^pright)^ \leqslant \left(\mathbb , X, ^pright)^ + \left(\mathbb f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>X + Y, ^pright)^ \leqslant \left(\mathbb , X, ^pright)^ + \left(\mathbb f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>X + Y, ^pright)^ \leqslant \left(\mathbb , X, ^pright)^ + \left(\mathbb f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>X + Y, ^pright)^ \leqslant \left(\mathbb , X, ^pright)^ + \left(\mathbb f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>X + Y, ^pright)^ \leqslant \left(\mathbb , X, ^pright)^ + \left(\mathbb f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>X + Y, ^pright)^ \leqslant \left(\mathbb , X, ^pright)^ + \left(\mathbb f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>X + Y, ^pright)^ \leqslant \left(\mathbb , X, ^pright)^ + \left(\mathbb f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>X + Y, ^pright)^ \leqslant \left(\mathbb , X, ^pright)^ + \left(\mathbb f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>X + Y, ^pright)^ \leqslant \left(\mathbb , X, ^pright)^ + \left(\mathbb f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>X + Y, ^pright)^ \leqslant \left(\mathbb , X, ^pright)^ + \left(\mathbb f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>X + Y, ^pright)^ \leqslant \left(\mathbb , X, ^pright)^ + \left(\mathbb f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>X + Y, ^pright)^ \leqslant \left(\mathbb , X, ^pright)^ + \left(\mathbb f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>X + Y, ^pright)^ \leqslant \left(\mathbb , X, ^pright)^ + \left(\mathbb f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>X + Y, ^pright)^ \leqslant \left(\mathbb , X, ^pright)^ + \left(\mathbb f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>X + Y, ^pright)^ \leqslant \left(\mathbb , X, ^pright)^ + \left(\mathbb f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>X + Y, ^pright)^ \leqslant \left(\mathbb , X, ^pright)^ + \left(\mathbb f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>X + Y, ^pright)^ \leqslant \left(\mathbb , X, ^pright)^ + \left(\mathbb f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>X + Y, ^pright)^ \leqslant \left(\mathbb , X, ^pright)^ + \left(\mathbb f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>X + Y, ^pright)^ \leqslant \left(\mathbb , X, ^pright)^ + \left(\mathbb f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>X + Y, ^pright)^ \leqslant \left(\mathbb , X, ^pright)^ + \left(\mathbb f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>X + Y, ^pright)^ \leqslant \left(\mathbb , X, ^pright)^ + \left(\mathbb f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>X + Y, ^pright)^ \leqslant \left(\mathbb , X, ^pright)^ + \left(\mathbb f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>X + Y, ^pright)^ \leqslant \left(\mathbb , X, ^pright)^ + \left(\mathbb f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>X + Y, ^pright)^ \leqslant \left(\mathbb , X, ^pright)^ + \left(\mathbb f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>X + Y, ^pright)^ \leqslant \left(\mathbb , X, ^pright)^ + \left(\mathbb f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>X + Y, ^pright)^ \leqslant \left(\mathbb , X, ^pright)^ + \left(\mathbb f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>X + Y, ^pright)^ \leqslant \left(\mathbb , X, ^pright)^ + \left(\mathbb f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>X + Y, ^pright)^ \leqslant \left(\mathbb , X, ^pright)^ + \left(\mathbb f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>X + Y, ^pright)^ \leqslant \left(\mathbb , X, ^pright)^ + \left(\mathbb f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>X + Y, ^pright)^ \leqslant \left(\mathbb , X, ^pright)^ + \left(\mathbb f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>X + Y, ^pright)^ \leqslant \left(\mathbb , X, ^pright)^ + \left(\mathbb f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>X + Y, ^pright)^ \leqslant \left(\mathbb , X, ^pright)^ + \left(\mathbb f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>X + Y, ^pright)^ \leqslant \left(\mathbb , X, ^pright)^ + \left(\mathbb f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>X + Y, ^pright)^ \leqslant \left(\mathbb , X, ^pright)^ + \left(\mathbb f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>X + Y, ^pright)^ \leqslant \left(\mathbb , X, ^pright)^ + \left(\mathbb f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>X + Y, ^pright)^ \leqslant \left(\mathbb , X, ^pright)^ + \left(\mathbb f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>X + Y, ^pright)^ \leqslant \left(\mathbb , X, ^pright)^ + \left(\mathbb f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>X + Y, ^pright)^ \leqslant \left(\mathbb , X, ^pright)^ + \left(\mathbb f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>X + Y, ^pright)^ \leqslant \left(\mathbb , X, ^pright)^ + \left(\mathbb f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>X + Y, ^pright)^ \leqslant \left(\mathbb , X, ^pright)^ + \left(\mathbb f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>X + Y, ^pright)^ \leqslant \left(\mathbb , X, ^pright)^ + \left(\mathbb f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>X + Y, ^pright)^ \leqslant \left(\mathbb , X, ^pright)^ + \left(\mathbb f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>X + Y, ^pright)^ \leqslant \left(\mathbb , X, ^pright)^ + \left(\mathbb f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>X + Y, ^pright)^ \leqslant \left(\mathbb , X, ^pright)^ + \left(\mathbb f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>X + Y, ^pright)^ \leqslant \left(\mathbb , X, ^pright)^ + \left(\mathbb f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>X + Y, ^pright)^ \leqslant \left(\mathbb , X, ^pright)^ + \left(\mathbb f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>X + Y, ^pright)^ \leqslant \left(\mathbb , X, ^pright)^ + \left(\mathbb f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>X + Y, ^pright)^ \leqslant \left(\mathbb , X, ^pright)^ + \left(\mathbb f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>X + Y, ^pright)^ \leqslant \left(\mathbb , X, ^pright)^ + \left(\mathbb f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>X + Y, ^pright)^ \leqslant \left(\mathbb , X, ^pright)^ + \left(\mathbb f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>X + Y, ^pright)^ \leqslant \left(\mathbb , X, ^pright)^ + \left(\mathbb f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>X + Y, ^pright)^ \leqslant \left(\mathbb , X, ^pright)^ + \left(\mathbb f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>X + Y, ^pright)^ \leqslant \left(\mathbb , X, ^pright)^ + \left(\mathbb f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>X + Y, ^pright)^ \leqslant \left(\mathbb , X, ^pright)^ + \left(\mathbb f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>X + Y, ^pright)^ \leqslant \left(\mathbb , X, ^pright)^ + \left(\mathbb f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>X + Y, ^pright)^ \leqslant \left(\mathbb , X, ^pright)^ + \left(\mathbb f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>X + Y, ^pright)^ \leqslant \left(\mathbb , X, ^pright)^ + \left(\mathbb f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>X + Y, ^pright)^ \leqslant \left(\mathbb , X, ^pright)^ + \left(\mathbb f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>X + Y, ^pright)^ \leqslant \left(\mathbb , X, ^pright)^ + \left(\mathbb f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>X + Y, ^pright)^ \leqslant \left(\mathbb , X, ^pright)^ + \left(\mathbb f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>X + Y, ^pright)^ \leqslant \left(\mathbb , X, ^pright)^ + \left(\mathbb f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>X + Y, ^pright)^ \leqslant \left(\mathbb , X, ^pright)^ + \left(\mathbb f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>X + Y, ^pright)^ \leqslant \left(\mathbb , X, ^pright)^ + \left(\mathbb f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>X + Y, ^pright)^ \leqslant \left(\mathbb , X, ^pright)^ + \left(\mathbb f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>X + Y, ^pright)^ \leqslant \left(\mathbb , X, ^pright)^ + \left(\mathbb f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>X + Y, ^pright)^ \leqslant \left(\mathbb , X, ^pright)^ + \left(\mathbb f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>X + Y, ^pright)^ \leqslant \left(\mathbb , X, ^pright)^ + \left(\mathbb f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>X + Y, ^pright)^ \leqslant \left(\mathbb , X, ^pright)^ + \left(\mathbb f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>X + Y, ^pright)^ \leqslant \left(\mathbb , X, ^pright)^ + \left(\mathbb f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>X + Y, ^pright)^ \leqslant \left(\mathbb , X, ^pright)^ + \left(\mathbb f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>X + Y, ^pright)^ \leqslant \left(\mathbb , X, ^pright)^ + \left(\mathbb f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>X + Y, ^pright)^ \leqslant \left(\mathbb , X, ^pright)^ + \left(\mathbb f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>X + Y, ^pright)^ \leqslant \left(\mathbb , X, ^pright)^ + \left(\mathbb f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>X + Y, ^pright)^ \leqslant \left(\mathbb , X, ^pright)^ + \left(\mathbb f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>X + Y, ^pright)^ \leqslant \left(\mathbb , X, ^pright)^ + \left(\mathbb f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>X + Y, ^pright)^ \leqslant \left(\mathbb , X, ^pright)^ + \left(\mathbb f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>X + Y, ^pright)^ \leqslant \left(\mathbb , X, ^pright)^ + \left(\mathbb f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>X + Y, ^pright)^ \leqslant \left(\mathbb , X, ^pright)^ + \left(\mathbb f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>X + Y, ^pright)^ \leqslant \left(\mathbb , X, ^pright)^ + \left(\mathbb f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>X + Y, ^pright)^ \leqslant \left(\mathbb , X, ^pright)^ + \left(\mathbb f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>X + Y, ^pright)^ \leqslant \left(\mathbb , X, ^pright)^ + \left(\mathbb f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>X + Y, ^pright)^ \leqslant \left(\mathbb , X, ^pright)^ + \left(\mathbb f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>X + Y, ^pright)^ \leqslant \left(\mathbb , X, ^pright)^ + \left(\mathbb f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>X + Y, ^pright)^ \leqslant \left(\mathbb , X, ^pright)^ + \left(\mathbb f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>X + Y, ^pright)^ \leqslant \left(\mathbb , X, ^pright)^ + \left(\mathbb f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>X + Y, ^pright)^ \leqslant \left(\mathbb , X, ^pright)^ + \left(\mathbb f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>X + Y, ^pright)^ \leqslant \left(\mathbb , X, ^pright)^ + \left(\mathbb f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>X + Y, ^pright)^ \leqslant \left(\mathbb , X, ^pright)^ + \left(\mathbb f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>X + Y, ^pright)^ \leqslant \left(\mathbb , X, ^pright)^ + \left(\mathbb f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>X + Y, ^pright)^ \leqslant \left(\mathbb , X, ^pright)^ + \left(\mathbb f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>X + Y, ^pright)^ \leqslant \left(\mathbb , X, ^pright)^ + \left(\mathbb f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>X + Y, ^pright)^ \leqslant \left(\mathbb , X, ^pright)^ + \left(\mathbb f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>X + Y, ^pright)^ \leqslant \left(\mathbb , X, ^pright)^ + \left(\mathbb f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>X + Y, ^pright)^ \leqslant \left(\mathbb , X, ^pright)^ + \left(\mathbb f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>X + Y, ^pright)^ \leqslant \left(\mathbb , X, ^pright)^ + \left(\mathbb f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>X + Y, ^pright)^ \leqslant \left(\mathbb , X, ^pright)^ + \left(\mathbb f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>X + Y, ^pright)^ \leqslant \left(\mathbb , X, ^pright)^ + \left(\mathbb f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>X + Y, ^pright)^ \leqslant \left(\mathbb , X, ^pright)^ + \left(\mathbb f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>X + Y, ^pright)^ \leqslant \left(\mathbb , X, ^pright)^ + \left(\mathbb f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>X + Y, ^pright)^ \leqslant \left(\mathbb , X, ^pright)^ + \left(\mathbb f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>X + Y, ^pright)^ \leqslant \left(\mathbb , X, ^pright)^ + \left(\mathbb f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>X + Y, ^pright)^ \leqslant \left(\mathbb , X, ^pright)^ + \left(\mathbb f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>X + Y, ^pright)^ \leqslant \left(\mathbb , X, ^pright)^ + \left(\mathbb f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>X + Y, ^pright)^ \leqslant \left(\mathbb , X, ^pright)^ + \left(\mathbb f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>X + Y, ^pright)^ \leqslant \left(\mathbb , X, ^pright)^ + \left(\mathbb f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>X + Y, ^pright)^ \leqslant \left(\mathbb , X, ^pright)^ + \left(\mathbb f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>X + Y, ^pright)^ \leqslant \left(\mathbb , X, ^pright)^ + \left(\mathbb f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>X + Y, ^pright)^ \leqslant \left(\mathbb , X, ^pright)^ + \left(\mathbb f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>X + Y, ^pright)^ \leqslant \left(\mathbb , X, ^pright)^ + \left(\mathbb f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>X + Y, ^pright)^ \leqslant \left(\mathbb , X, ^pright)^ + \left(\mathbb f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>X + Y, ^pright)^ \leqslant \left(\mathbb , X, ^pright)^ + \left(\mathbb f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>X + Y, ^pright)^ \leqslant \left(\mathbb , X, ^pright)^ + \left(\mathbb f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>X + Y, ^pright)^ \leqslant \left(\mathbb , X, ^pright)^ + \left(\mathbb f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>X + Y, ^pright)^ \leqslant \left(\mathbb , X, ^pright)^ + \left(\mathbb f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>X + Y, ^pright)^ \leqslant \left(\mathbb , X, ^pright)^ + \left(\mathbb f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>X + Y, ^pright)^ \leqslant \left(\mathbb , X, ^pright)^ + \left(\mathbb f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>X + Y, ^pright)^ \leqslant \left(\mathbb , X, ^pright)^ + \left(\mathbb f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>X + Y, ^pright)^ \leqslant \left(\mathbb , X, ^pright)^ + \left(\mathbb f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>X + Y, ^pright)^ \leqslant \left(\mathbb , X, ^pright)^ + \left(\mathbb f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>X + Y, ^pright)^ \leqslant \left(\mathbb , X, ^pright)^ + \left(\mathbb f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>X + Y, ^pright)^ \leqslant \left(\mathbb , X, ^pright)^ + \left(\mathbb f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>X + Y, ^pright)^ \leqslant \left(\mathbb , X, ^pright)^ + \left(\mathbb f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>X + Y, ^pright)^ \leqslant \left(\mathbb , X, ^pright)^ + \left(\mathbb f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>X + Y, ^pright)^ \leqslant \left(\mathbb , X, ^pright)^ + \left(\mathbb f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>X + Y, ^pright)^ \leqslant \left(\mathbb , X, ^pright)^ + \left(\mathbb f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>X + Y, ^pright)^ \leqslant \left(\mathbb , X, ^pright)^ + \left(\mathbb f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>X + Y, ^pright)^ \leqslant \left(\mathbb , X, ^pright)^ + \left(\mathbb f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>X + Y, ^pright)^ \leqslant \left(\mathbb , X, ^pright)^ + \left(\mathbb f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>X + Y, ^pright)^ \leqslant \left(\mathbb , X, ^pright)^ + \left(\mathbb f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>X + Y, ^pright)^ \leqslant \left(\mathbb , X, ^pright)^ + \left(\mathbb f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>X + Y, ^pright)^ \leqslant \left(\mathbb , X, ^pright)^ + \left(\mathbb f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>X + Y, ^pright)^ \leqslant \left(\mathbb , X, ^pright)^ + \left(\mathbb f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>X + Y, ^pright)^ \leqslant \left(\mathbb , X, ^pright)^ + \left(\mathbb f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>X + Y, ^pright)^ \leqslant \left(\mathbb , X, ^pright)^ + \left(\mathbb f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>X + Y, ^pright)^ \leqslant \left(\mathbb , X, ^pright)^ + \left(\mathbb f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>X + Y, ^pright)^ \leqslant \left(\mathbb , X, ^pright)^ + \left(\mathbb f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>X + Y, ^pright)^ \leqslant \left(\mathbb , X, ^pright)^ + \left(\mathbb f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>X + Y, ^pright)^ \leqslant \left(\mathbb , X, ^pright)^ + \left(\mathbb f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>X + Y, ^pright)^ \leqslant \left(\mathbb , X, ^pright)^ + \left(\mathbb f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>X + Y, ^pright)^ \leqslant \left(\mathbb , X, ^pright)^ + \left(\mathbb f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>X + Y, ^pright)^ \leqslant \left(\mathbb , X, ^pright)^ + \left(\mathbb f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>X + Y, ^pright)^ \leqslant \left(\mathbb , X, ^pright)^ + \left(\mathbb f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>X + Y, ^pright)^ \leqslant \left(\mathbb , X, ^pright)^ + \left(\mathbb f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>X + Y, ^pright)^ \leqslant \left(\mathbb , X, ^pright)^ + \left(\mathbb f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>X + Y, ^pright)^ \leqslant \left(\mathbb , X, ^pright)^ + \left(\mathbb f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>X + Y, ^pright)^ \leqslant \left(\mathbb , X, ^pright)^ + \left(\mathbb f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>X + Y, ^pright)^ \leqslant \left(\mathbb , X, ^pright)^ + \left(\mathbb f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>X + Y, ^pright)^ \leqslant \left(\mathbb , X, ^pright)^ + \left(\mathbb f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>X + Y, ^pright)^ \leqslant \left(\mathbb , X, ^pright)^ + \left(\mathbb f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>X + Y, ^pright)^ \leqslant \left(\mathbb , X, ^pright)^ + \left(\mathbb f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>X + Y, ^pright)^ \leqslant \left(\mathbb , X, ^pright)^ + \left(\mathbb f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>X + Y, ^pright)^ \leqslant \left(\mathbb , X, ^pright)^ + \left(\mathbb f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>X + Y, ^pright)^ \leqslant \left(\mathbb , X, ^pright)^ + \left(\mathbb f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>X + Y, ^pright)^ \leqslant \left(\mathbb , X, ^pright)^ + \left(\mathbb f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>X + Y, ^pright)^ \leqslant \left(\mathbb , X, ^pright)^ + \left(\mathbb f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>X + Y, ^pright)^ \leqslant \left(\mathbb , X, ^pright)^ + \left(\mathbb f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>X + Y, ^pright)^ \leqslant \left(\mathbb , X, ^pright)^ + \left(\mathbb f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>X + Y, ^pright)^ \leqslant \left(\mathbb , X, ^pright)^ + \left(\mathbb f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>X + Y, ^pright)^ \leqslant \left(\mathbb , X, ^pright)^ + \left(\mathbb f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>X + Y, ^pright)^ \leqslant \left(\mathbb , X, ^pright)^ + \left(\mathbb f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>X + Y, ^pright)^ \leqslant \left(\mathbb , X, ^pright)^ + \left(\mathbb f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>X + Y, ^pright)^ \leqslant \left(\mathbb , X, ^pright)^ + \left(\mathbb f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>X + Y, ^pright)^ \leqslant \left(\mathbb , X, ^pright)^ + \left(\mathbb f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>X + Y, ^pright)^ \leqslant \left(\mathbb , X, ^pright)^ + \left(\mathbb f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>X + Y, ^pright)^ \leqslant \left(\mathbb , X, ^pright)^ + \left(\mathbb f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>X + Y, ^pright)^ \leqslant \left(\mathbb , X, ^pright)^ + \left(\mathbb f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>X + Y, ^pright)^ \leqslant \left(\mathbb , X, ^pright)^ + \left(\mathbb f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>X + Y, ^pright)^ \leqslant \left(\mathbb , X, ^pright)^ + \left(\mathbb f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>X + Y, ^pright)^ \leqslant \left(\mathbb , X, ^pright)^ + \left(\mathbb f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>X + Y, ^pright)^ \leqslant \left(\mathbb , X, ^pright)^ + \left(\mathbb f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>X + Y, ^pright)^ \leqslant \left(\mathbb , X, ^pright)^ + \left(\mathbb f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>X + Y, ^pright)^ \leqslant \left(\mathbb , X, ^pright)^ + \left(\mathbb f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>X + Y, ^pright)^ \leqslant \left(\mathbb , X, ^pright)^ + \left(\mathbb f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>X + Y, ^pright)^ \leqslant \left(\mathbb , X, ^pright)^ + \left(\mathbb f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>X + Y, ^pright)^ \leqslant \left(\mathbb , X, ^pright)^ + \left(\mathbb f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>X + Y, ^pright)^ \leqslant \left(\mathbb , X, ^pright)^ + \left(\mathbb f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>X + Y, ^pright)^ \leqslant \left(\mathbb , X, ^pright)^ + \left(\mathbb f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>X + Y, ^pright)^ \leqslant \left(\mathbb , X, ^pright)^ + \left(\mathbb f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>X + Y, ^pright)^ \leqslant \left(\mathbb , X, ^pright)^ + \left(\mathbb f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>X + Y, ^pright)^ \leqslant \left(\mathbb , X, ^pright)^ + \left(\mathbb f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>X + Y, ^pright)^ \leqslant \left(\mathbb , X, ^pright)^ + \left(\mathbb f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>X + Y, ^pright)^ \leqslant \left(\mathbb , X, ^pright)^ + \left(\mathbb f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>X + Y, ^pright)^ \leqslant \left(\mathbb , X, ^pright)^ + \left(\mathbb f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>X + Y, ^pright)^ \leqslant \left(\mathbb , X, ^pright)^ + \left(\mathbb f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>X + Y, ^pright)^ \leqslant \left(\mathbb , X, ^pright)^ + \left(\mathbb f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>X + Y, ^pright)^ \leqslant \left(\mathbb , X, ^pright)^ + \left(\mathbb f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>X + Y, ^pright)^ \leqslant \left(\mathbb , X, ^pright)^ + \left(\mathbb f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>X + Y, ^pright)^ \leqslant \left(\mathbb , X, ^pright)^ + \left(\mathbb f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>X + Y, ^pright)^ \leqslant \left(\mathbb , X, ^pright)^ + \left(\mathbb f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>X + Y, ^pright)^ \leqslant \left(\mathbb , X, ^pright)^ + \left(\mathbb f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>X + Y, ^pright)^ \leqslant \left(\mathbb , X, ^pright)^ + \left(\mathbb f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>X + Y, ^pright)^ \leqslant \left(\mathbb , X, ^pright)^ + \left(\mathbb f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>X + Y, ^pright)^ \leqslant \left(\mathbb , X, ^pright)^ + \left(\mathbb f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>X + Y, ^pright)^ \leqslant \left(\mathbb , X, ^pright)^ + \left(\mathbb f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>X + Y, ^pright)^ \leqslant \left(\mathbb , X, ^pright)^ + \left(\mathbb f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>X + Y, ^pright)^ \leqslant \left(\mathbb , X, ^pright)^ + \left(\mathbb f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>X + Y, ^pright)^ \leqslant \left(\mathbb , X, ^pright)^ + \left(\mathbb f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>X + Y, ^pright)^ \leqslant \left(\mathbb , X, ^pright)^ + \left(\mathbb f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>X + Y, ^pright)^ \leqslant \left(\mathbb , X, ^pright)^ + \left(\mathbb f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>X + Y, ^pright)^ \leqslant \left(\mathbb , X, ^pright)^ + \left(\mathbb f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>X + Y, ^pright)^ \leqslant \left(\mathbb , X, ^pright)^ + \left(\mathbb f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>X + Y, ^pright)^ \leqslant \left(\mathbb , X, ^pright)^ + \left(\mathbb f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>X + Y, ^pright)^ \leqslant \left(\mathbb , X, ^pright)^ + \left(\mathbb f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>X + Y, ^pright)^ \leqslant \left(\mathbb , X, ^pright)^ + \left(\mathbb f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>X + Y, ^pright)^ \leqslant \left(\mathbb , X, ^pright)^ + \left(\mathbb f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>X + Y, ^pright)^ \leqslant \left(\mathbb , X, ^pright)^ + \left(\mathbb f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>X + Y, ^pright)^ \leqslant \left(\mathbb , X, ^pright)^ + \left(\mathbb f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>X + Y, ^pright)^ \leqslant \left(\mathbb , X, ^pright)^ + \left(\mathbb f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>X + Y, ^pright)^ \leqslant \left(\mathbb , X, ^pright)^ + \left(\mathbb f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>X + Y, ^pright)^ \leqslant \left(\mathbb , X, ^pright)^ + \left(\mathbb f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>X + Y, ^pright)^ \leqslant \left(\mathbb , X, ^pright)^ + \left(\mathbb f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>X + Y, ^pright)^ \leqslant \left(\mathbb , X, ^pright)^ + \left(\mathbb f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>X + Y, ^pright)^ \leqslant \left(\mathbb , X, ^pright)^ + \left(\mathbb f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>X + Y, ^pright)^ \leqslant \left(\mathbb , X, ^pright)^ + \left(\mathbb f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>X + Y, ^pright)^ \leqslant \left(\mathbb , X, ^pright)^ + \left(\mathbb f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>X + Y, ^pright)^ \leqslant \left(\mathbb , X, ^pright)^ + \left(\mathbb f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>X + Y, ^pright)^ \leqslant \left(\mathbb , X, ^pright)^ + \left(\mathbb f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>X + Y, ^pright)^ \leqslant \left(\mathbb , X, ^pright)^ + \left(\mathbb f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>X + Y, ^pright)^ \leqslant \left(\mathbb , X, ^pright)^ + \left(\mathbb f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>X + Y, ^pright)^ \leqslant \left(\mathbb , X, ^pright)^ + \left(\mathbb f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>X + Y, ^pright)^ \leqslant \left(\mathbb , X, ^pright)^ + \left(\mathbb[, Y, ^p]\right)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description]">Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>X + Y, ^pright)^ \leqslant \left(\mathbb , X, ^pright)^ + \left(\mathbb f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>X + Y, ^pright)^ \leqslant \left(\mathbb , X, ^pright)^ + \left(\mathbb f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>X + Y, ^pright)^ \leqslant \left(\mathbb , X, ^pright)^ + \left(\mathbb f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>X + Y, ^pright)^ \leqslant \left(\mathbb , X, ^pright)^ + \left(\mathbb f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>X + Y, ^pright)^ \leqslant \left(\mathbb , X, ^pright)^ + \left(\mathbb f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>X + Y, ^pright)^ \leqslant \left(\mathbb , X, ^pright)^ + \left(\mathbb f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>X + Y, ^pright)^ \leqslant \left(\mathbb , X, ^pright)^ + \left(\mathbb f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>X + Y, ^pright)^ \leqslant \left(\mathbb , X, ^pright)^ + \left(\mathbb f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>X + Y, ^pright)^ \leqslant \left(\mathbb , X, ^pright)^ + \left(\mathbb f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>X + Y, ^pright)^ \leqslant \left(\mathbb , X, ^pright)^ + \left(\mathbb f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>X + Y, ^pright)^ \leqslant \left(\mathbb , X, ^pright)^ + \left(\mathbb f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>X + Y, ^pright)^ \leqslant \left(\mathbb , X, ^pright)^ + \left(\mathbb f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>X + Y, ^pright)^ \leqslant \left(\mathbb , X, ^pright)^ + \left(\mathbb f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>X + Y, ^pright)^ \leqslant \left(\mathbb , X, ^pright)^ + \left(\mathbb f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>X + Y, ^pright)^ \leqslant \left(\mathbb , X, ^pright)^ + \left(\mathbb f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>X + Y, ^pright)^ \leqslant \left(\mathbb , X, ^pright)^ + \left(\mathbb f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>X + Y, ^pright)^ \leqslant \left(\mathbb , X, ^pright)^ + \left(\mathbb f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>X + Y, ^pright)^ \leqslant \left(\mathbb , X, ^pright)^ + \left(\mathbb f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>X + Y, ^pright)^ \leqslant \left(\mathbb , X, ^pright)^ + \left(\mathbb f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>X + Y, ^pright)^ \leqslant \left(\mathbb , X, ^pright)^ + \left(\mathbb f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>X + Y, ^pright)^ \leqslant \left(\mathbb , X, ^pright)^ + \left(\mathbb f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>X + Y, ^pright)^ \leqslant \left(\mathbb , X, ^pright)^ + \left(\mathbb f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>X + Y, ^pright)^ \leqslant \left(\mathbb , X, ^pright)^ + \left(\mathbb f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>X + Y, ^pright)^ \leqslant \left(\mathbb , X, ^pright)^ + \left(\mathbb f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>X + Y, ^pright)^ \leqslant \left(\mathbb , X, ^pright)^ + \left(\mathbb f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>X + Y, ^pright)^ \leqslant \left(\mathbb , X, ^pright)^ + \left(\mathbb f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>X + Y, ^pright)^ \leqslant \left(\mathbb , X, ^pright)^ + \left(\mathbb f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>X + Y, ^pright)^ \leqslant \left(\mathbb , X, ^pright)^ + \left(\mathbb f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>X + Y, ^pright)^ \leqslant \left(\mathbb , X, ^pright)^ + \left(\mathbb f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>X + Y, ^pright)^ \leqslant \left(\mathbb , X, ^pright)^ + \left(\mathbb f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>X + Y, ^pright)^ \leqslant \left(\mathbb , X, ^pright)^ + \left(\mathbb f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>X + Y, ^pright)^ \leqslant \left(\mathbb , X, ^pright)^ + \left(\mathbb f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>X + Y, ^pright)^ \leqslant \left(\mathbb , X, ^pright)^ + \left(\mathbb f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>X + Y, ^pright)^ \leqslant \left(\mathbb , X, ^pright)^ + \left(\mathbb f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>X + Y, ^pright)^ \leqslant \left(\mathbb , X, ^pright)^ + \left(\mathbb f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>X + Y, ^pright)^ \leqslant \left(\mathbb , X, ^pright)^ + \left(\mathbb f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>X + Y, ^pright)^ \leqslant \left(\mathbb , X, ^pright)^ + \left(\mathbb f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>X + Y, ^pright)^ \leqslant \left(\mathbb , X, ^pright)^ + \left(\mathbb f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>X + Y, ^pright)^ \leqslant \left(\mathbb , X, ^pright)^ + \left(\mathbb f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>X + Y, ^pright)^ \leqslant \left(\mathbb , X, ^pright)^ + \left(\mathbb f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>X + Y, ^pright)^ \leqslant \left(\mathbb , X, ^pright)^ + \left(\mathbb f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>X + Y, ^pright)^ \leqslant \left(\mathbb , X, ^pright)^ + \left(\mathbb f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>X + Y, ^pright)^ \leqslant \left(\mathbb , X, ^pright)^ + \left(\mathbb f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>X + Y, ^pright)^ \leqslant \left(\mathbb , X, ^pright)^ + \left(\mathbb f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>X + Y, ^pright)^ \leqslant \left(\mathbb , X, ^pright)^ + \left(\mathbb f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>X + Y, ^pright)^ \leqslant \left(\mathbb , X, ^pright)^ + \left(\mathbb f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>X + Y, ^pright)^ \leqslant \left(\mathbb , X, ^pright)^ + \left(\mathbb f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>X + Y, ^pright)^ \leqslant \left(\mathbb , X, ^pright)^ + \left(\mathbb f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>X + Y, ^pright)^ \leqslant \left(\mathbb , X, ^pright)^ + \left(\mathbb f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>X + Y, ^pright)^ \leqslant \left(\mathbb , X, ^pright)^ + \left(\mathbb f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>X + Y, ^pright)^ \leqslant \left(\mathbb , X, ^pright)^ + \left(\mathbb f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>X + Y, ^pright)^ \leqslant \left(\mathbb , X, ^pright)^ + \left(\mathbb f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>X + Y, ^pright)^ \leqslant \left(\mathbb , X, ^pright)^ + \left(\mathbb f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>X + Y, ^pright)^ \leqslant \left(\mathbb , X, ^pright)^ + \left(\mathbb f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>X + Y, ^pright)^ \leqslant \left(\mathbb , X, ^pright)^ + \left(\mathbb f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>X + Y, ^pright)^ \leqslant \left(\mathbb , X, ^pright)^ + \left(\mathbb f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>X + Y, ^pright)^ \leqslant \left(\mathbb , X, ^pright)^ + \left(\mathbb f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>X + Y, ^pright)^ \leqslant \left(\mathbb , X, ^pright)^ + \left(\mathbb f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>X + Y, ^pright)^ \leqslant \left(\mathbb , X, ^pright)^ + \left(\mathbb f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>X + Y, ^pright)^ \leqslant \left(\mathbb , X, ^pright)^ + \left(\mathbb f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>X + Y, ^pright)^ \leqslant \left(\mathbb , X, ^pright)^ + \left(\mathbb f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>X + Y, ^pright)^ \leqslant \left(\mathbb , X, ^pright)^ + \left(\mathbb f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>X + Y, ^pright)^ \leqslant \left(\mathbb , X, ^pright)^ + \left(\mathbb f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>X + Y, ^pright)^ \leqslant \left(\mathbb , X, ^pright)^ + \left(\mathbb f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>X + Y, ^pright)^ \leqslant \left(\mathbb , X, ^pright)^ + \left(\mathbb f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>X + Y, ^pright)^ \leqslant \left(\mathbb , X, ^pright)^ + \left(\mathbb f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>X + Y, ^pright)^ \leqslant \left(\mathbb , X, ^pright)^ + \left(\mathbb f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>X + Y, ^pright)^ \leqslant \left(\mathbb , X, ^pright)^ + \left(\mathbb f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>X + Y, ^pright)^ \leqslant \left(\mathbb , X, ^pright)^ + \left(\mathbb f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>X + Y, ^pright)^ \leqslant \left(\mathbb , X, ^pright)^ + \left(\mathbb f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>X + Y, ^pright)^ \leqslant \left(\mathbb , X, ^pright)^ + \left(\mathbb f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>X + Y, ^pright)^ \leqslant \left(\mathbb , X, ^pright)^ + \left(\mathbb f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>X + Y, ^pright)^ \leqslant \left(\mathbb , X, ^pright)^ + \left(\mathbb f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>X + Y, ^pright)^ \leqslant \left(\mathbb , X, ^pright)^ + \left(\mathbb f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>X + Y, ^pright)^ \leqslant \left(\mathbb , X, ^pright)^ + \left(\mathbb f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>X + Y, ^pright)^ \leqslant \left(\mathbb , X, ^pright)^ + \left(\mathbb f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>X + Y, ^pright)^ \leqslant \left(\mathbb , X, ^pright)^ + \left(\mathbb f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>X + Y, ^pright)^ \leqslant \left(\mathbb , X, ^pright)^ + \left(\mathbb f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>X + Y, ^pright)^ \leqslant \left(\mathbb , X, ^pright)^ + \left(\mathbb f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>X + Y, ^pright)^ \leqslant \left(\mathbb , X, ^pright)^ + \left(\mathbb f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>X + Y, ^pright)^ \leqslant \left(\mathbb , X, ^pright)^ + \left(\mathbb f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>X + Y, ^pright)^ \leqslant \left(\mathbb , X, ^pright)^ + \left(\mathbb f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>X + Y, ^pright)^ \leqslant \left(\mathbb , X, ^pright)^ + \left(\mathbb f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>X + Y, ^pright)^ \leqslant \left(\mathbb , X, ^pright)^ + \left(\mathbb f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>X + Y, ^pright)^ \leqslant \left(\mathbb , X, ^pright)^ + \left(\mathbb f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>X + Y, ^pright)^ \leqslant \left(\mathbb , X, ^pright)^ + \left(\mathbb f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>X + Y, ^pright)^ \leqslant \left(\mathbb , X, ^pright)^ + \left(\mathbb f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>X + Y, ^pright)^ \leqslant \left(\mathbb , X, ^pright)^ + \left(\mathbb f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>X + Y, ^pright)^ \leqslant \left(\mathbb , X, ^pright)^ + \left(\mathbb f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>X + Y, ^pright)^ \leqslant \left(\mathbb , X, ^pright)^ + \left(\mathbb f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>X + Y, ^pright)^ \leqslant \left(\mathbb , X, ^pright)^ + \left(\mathbb f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>X + Y, ^pright)^ \leqslant \left(\mathbb , X, ^pright)^ + \left(\mathbb f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>X + Y, ^pright)^ \leqslant \left(\mathbb , X, ^pright)^ + \left(\mathbb f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>X + Y, ^pright)^ \leqslant \left(\mathbb , X, ^pright)^ + \left(\mathbb f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>X + Y, ^pright)^ \leqslant \left(\mathbb , X, ^pright)^ + \left(\mathbb f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>X + Y, ^pright)^ \leqslant \left(\mathbb , X, ^pright)^ + \left(\mathbb f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>X + Y, ^pright)^ \leqslant \left(\mathbb , X, ^pright)^ + \left(\mathbb f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>X + Y, ^pright)^ \leqslant \left(\mathbb , X, ^pright)^ + \left(\mathbb f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>X + Y, ^pright)^ \leqslant \left(\mathbb , X, ^pright)^ + \left(\mathbb f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>X + Y, ^pright)^ \leqslant \left(\mathbb , X, ^pright)^ + \left(\mathbb f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>X + Y, ^pright)^ \leqslant \left(\mathbb , X, ^pright)^ + \left(\mathbb f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>X + Y, ^pright)^ \leqslant \left(\mathbb , X, ^pright)^ + \left(\mathbb f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>X + Y, ^pright)^ \leqslant \left(\mathbb , X, ^pright)^ + \left(\mathbb f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>X + Y, ^pright)^ \leqslant \left(\mathbb , X, ^pright)^ + \left(\mathbb f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>X + Y, ^pright)^ \leqslant \left(\mathbb , X, ^pright)^ + \left(\mathbb f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>X + Y, ^pright)^ \leqslant \left(\mathbb , X, ^pright)^ + \left(\mathbb f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>X + Y, ^pright)^ \leqslant \left(\mathbb , X, ^pright)^ + \left(\mathbb f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>X + Y, ^pright)^ \leqslant \left(\mathbb , X, ^pright)^ + \left(\mathbb f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>X + Y, ^pright)^ \leqslant \left(\mathbb , X, ^pright)^ + \left(\mathbb f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>X + Y, ^pright)^ \leqslant \left(\mathbb , X, ^pright)^ + \left(\mathbb f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>X + Y, ^pright)^ \leqslant \left(\mathbb , X, ^pright)^ + \left(\mathbb f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>X + Y, ^pright)^ \leqslant \left(\mathbb , X, ^pright)^ + \left(\mathbb f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>X + Y, ^pright)^ \leqslant \left(\mathbb , X, ^pright)^ + \left(\mathbb f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>X + Y, ^pright)^ \leqslant \left(\mathbb , X, ^pright)^ + \left(\mathbb f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>X + Y, ^pright)^ \leqslant \left(\mathbb , X, ^pright)^ + \left(\mathbb f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>X + Y, ^pright)^ \leqslant \left(\mathbb , X, ^pright)^ + \left(\mathbb f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>X + Y, ^pright)^ \leqslant \left(\mathbb , X, ^pright)^ + \left(\mathbb f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>X + Y, ^pright)^ \leqslant \left(\mathbb , X, ^pright)^ + \left(\mathbb f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>X + Y, ^pright)^ \leqslant \left(\mathbb , X, ^pright)^ + \left(\mathbb f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>X + Y, ^pright)^ \leqslant \left(\mathbb , X, ^pright)^ + \left(\mathbb f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>X + Y, ^pright)^ \leqslant \left(\mathbb , X, ^pright)^ + \left(\mathbb f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>X + Y, ^pright)^ \leqslant \left(\mathbb , X, ^pright)^ + \left(\mathbb f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>X + Y, ^pright)^ \leqslant \left(\mathbb , X, ^pright)^ + \left(\mathbb f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>X + Y, ^pright)^ \leqslant \left(\mathbb , X, ^pright)^ + \left(\mathbb f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>X + Y, ^pright)^ \leqslant \left(\mathbb , X, ^pright)^ + \left(\mathbb f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>X + Y, ^pright)^ \leqslant \left(\mathbb , X, ^pright)^ + \left(\mathbb f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>X + Y, ^pright)^ \leqslant \left(\mathbb , X, ^pright)^ + \left(\mathbb f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>X + Y, ^pright)^ \leqslant \left(\mathbb , X, ^pright)^ + \left(\mathbb f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>X + Y, ^pright)^ \leqslant \left(\mathbb , X, ^pright)^ + \left(\mathbb f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>X + Y, ^pright)^ \leqslant \left(\mathbb , X, ^pright)^ + \left(\mathbb f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>X + Y, ^pright)^ \leqslant \left(\mathbb , X, ^pright)^ + \left(\mathbb f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>X + Y, ^pright)^ \leqslant \left(\mathbb , X, ^pright)^ + \left(\mathbb f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>X + Y, ^pright)^ \leqslant \left(\mathbb , X, ^pright)^ + \left(\mathbb f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>X + Y, ^pright)^ \leqslant \left(\mathbb , X, ^pright)^ + \left(\mathbb f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>X + Y, ^pright)^ \leqslant \left(\mathbb , X, ^pright)^ + \left(\mathbb f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>X + Y, ^pright)^ \leqslant \left(\mathbb , X, ^pright)^ + \left(\mathbb f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>X + Y, ^pright)^ \leqslant \left(\mathbb , X, ^pright)^ + \left(\mathbb f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>X + Y, ^pright)^ \leqslant \left(\mathbb , X, ^pright)^ + \left(\mathbb f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>X + Y, ^pright)^ \leqslant \left(\mathbb , X, ^pright)^ + \left(\mathbb f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>X + Y, ^pright)^ \leqslant \left(\mathbb , X, ^pright)^ + \left(\mathbb f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>X + Y, ^pright)^ \leqslant \left(\mathbb , X, ^pright)^ + \left(\mathbb f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>X + Y, ^pright)^ \leqslant \left(\mathbb , X, ^pright)^ + \left(\mathbb f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>X + Y, ^pright)^ \leqslant \left(\mathbb , X, ^pright)^ + \left(\mathbb f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>X + Y, ^pright)^ \leqslant \left(\mathbb , X, ^pright)^ + \left(\mathbb f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>X + Y, ^pright)^ \leqslant \left(\mathbb , X, ^pright)^ + \left(\mathbb f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>X + Y, ^pright)^ \leqslant \left(\mathbb , X, ^pright)^ + \left(\mathbb f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>X + Y, ^pright)^ \leqslant \left(\mathbb , X, ^pright)^ + \left(\mathbb f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>X + Y, ^pright)^ \leqslant \left(\mathbb , X, ^pright)^ + \left(\mathbb f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>X + Y, ^pright)^ \leqslant \left(\mathbb , X, ^pright)^ + \left(\mathbb f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>X + Y, ^pright)^ \leqslant \left(\mathbb , X, ^pright)^ + \left(\mathbb f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>X + Y, ^pright)^ \leqslant \left(\mathbb , X, ^pright)^ + \left(\mathbb f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>X + Y, ^pright)^ \leqslant \left(\mathbb , X, ^pright)^ + \left(\mathbb f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>X + Y, ^pright)^ \leqslant \left(\mathbb , X, ^pright)^ + \left(\mathbb f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>X + Y, ^pright)^ \leqslant \left(\mathbb , X, ^pright)^ + \left(\mathbb f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>X + Y, ^pright)^ \leqslant \left(\mathbb , X, ^pright)^ + \left(\mathbb f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>X + Y, ^pright)^ \leqslant \left(\mathbb , X, ^pright)^ + \left(\mathbb f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>X + Y, ^pright)^ \leqslant \left(\mathbb , X, ^pright)^ + \left(\mathbb f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>X + Y, ^pright)^ \leqslant \left(\mathbb , X, ^pright)^ + \left(\mathbb f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>X + Y, ^pright)^ \leqslant \left(\mathbb , X, ^pright)^ + \left(\mathbb f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>X + Y, ^pright)^ \leqslant \left(\mathbb , X, ^pright)^ + \left(\mathbb f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>X + Y, ^pright)^ \leqslant \left(\mathbb , X, ^pright)^ + \left(\mathbb f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>X + Y, ^pright)^ \leqslant \left(\mathbb , X, ^pright)^ + \left(\mathbb f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>X + Y, ^pright)^ \leqslant \left(\mathbb , X, ^pright)^ + \left(\mathbb f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>X + Y, ^pright)^ \leqslant \left(\mathbb , X, ^pright)^ + \left(\mathbb f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>X + Y, ^pright)^ \leqslant \left(\mathbb , X, ^pright)^ + \left(\mathbb f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>X + Y, ^pright)^ \leqslant \left(\mathbb , X, ^pright)^ + \left(\mathbb f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>X + Y, ^pright)^ \leqslant \left(\mathbb , X, ^pright)^ + \left(\mathbb f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>X + Y, ^pright)^ \leqslant \left(\mathbb , X, ^pright)^ + \left(\mathbb f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>X + Y, ^pright)^ \leqslant \left(\mathbb , X, ^pright)^ + \left(\mathbb f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>X + Y, ^pright)^ \leqslant \left(\mathbb , X, ^pright)^ + \left(\mathbb f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>X + Y, ^pright)^ \leqslant \left(\mathbb , X, ^pright)^ + \left(\mathbb f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>X + Y, ^pright)^ \leqslant \left(\mathbb , X, ^pright)^ + \left(\mathbb f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>X + Y, ^pright)^ \leqslant \left(\mathbb , X, ^pright)^ + \left(\mathbb f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>X + Y, ^pright)^ \leqslant \left(\mathbb , X, ^pright)^ + \left(\mathbb f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>X + Y, ^pright)^ \leqslant \left(\mathbb , X, ^pright)^ + \left(\mathbb f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>X + Y, ^pright)^ \leqslant \left(\mathbb , X, ^pright)^ + \left(\mathbb f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>X + Y, ^pright)^ \leqslant \left(\mathbb , X, ^pright)^ + \left(\mathbb f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>X + Y, ^pright)^ \leqslant \left(\mathbb , X, ^pright)^ + \left(\mathbb f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>X + Y, ^pright)^ \leqslant \left(\mathbb , X, ^pright)^ + \left(\mathbb f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>X + Y, ^pright)^ \leqslant \left(\mathbb , X, ^pright)^ + \left(\mathbb f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>X + Y, ^pright)^ \leqslant \left(\mathbb , X, ^pright)^ + \left(\mathbb f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>X + Y, ^pright)^ \leqslant \left(\mathbb , X, ^pright)^ + \left(\mathbb f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>X + Y, ^pright)^ \leqslant \left(\mathbb , X, ^pright)^ + \left(\mathbb f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>X + Y, ^pright)^ \leqslant \left(\mathbb , X, ^pright)^ + \left(\mathbb f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>X + Y, ^pright)^ \leqslant \left(\mathbb , X, ^pright)^ + \left(\mathbb f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>X + Y, ^pright)^ \leqslant \left(\mathbb , X, ^pright)^ + \left(\mathbb f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>X + Y, ^pright)^ \leqslant \left(\mathbb , X, ^pright)^ + \left(\mathbb f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>X + Y, ^pright)^ \leqslant \left(\mathbb , X, ^pright)^ + \left(\mathbb f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>X + Y, ^pright)^ \leqslant \left(\mathbb , X, ^pright)^ + \left(\mathbb f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>X + Y, ^pright)^ \leqslant \left(\mathbb , X, ^pright)^ + \left(\mathbb f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>X + Y, ^pright)^ \leqslant \left(\mathbb , X, ^pright)^ + \left(\mathbb f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>X + Y, ^pright)^ \leqslant \left(\mathbb , X, ^pright)^ + \left(\mathbb f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>X + Y, ^pright)^ \leqslant \left(\mathbb , X, ^pright)^ + \left(\mathbb f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>X + Y, ^pright)^ \leqslant \left(\mathbb , X, ^pright)^ + \left(\mathbb f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>X + Y, ^pright)^ \leqslant \left(\mathbb , X, ^pright)^ + \left(\mathbb f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>X + Y, ^pright)^ \leqslant \left(\mathbb , X, ^pright)^ + \left(\mathbb f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>X + Y, ^pright)^ \leqslant \left(\mathbb , X, ^pright)^ + \left(\mathbb f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>X + Y, ^pright)^ \leqslant \left(\mathbb , X, ^pright)^ + \left(\mathbb f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>X + Y, ^pright)^ \leqslant \left(\mathbb , X, ^pright)^ + \left(\mathbb f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>X + Y, ^pright)^ \leqslant \left(\mathbb , X, ^pright)^ + \left(\mathbb f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>X + Y, ^pright)^ \leqslant \left(\mathbb , X, ^pright)^ + \left(\mathbb f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>X + Y, ^pright)^ \leqslant \left(\mathbb , X, ^pright)^ + \left(\mathbb f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>X + Y, ^pright)^ \leqslant \left(\mathbb , X, ^pright)^ + \left(\mathbb f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>X + Y, ^pright)^ \leqslant \left(\mathbb , X, ^pright)^ + \left(\mathbb f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>X + Y, ^pright)^ \leqslant \left(\mathbb , X, ^pright)^ + \left(\mathbb f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>X + Y, ^pright)^ \leqslant \left(\mathbb , X, ^pright)^ + \left(\mathbb f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>X + Y, ^pright)^ \leqslant \left(\mathbb , X, ^pright)^ + \left(\mathbb f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>X + Y, ^pright)^ \leqslant \left(\mathbb , X, ^pright)^ + \left(\mathbb f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>X + Y, ^pright)^ \leqslant \left(\mathbb , X, ^pright)^ + \left(\mathbb f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>X + Y, ^pright)^ \leqslant \left(\mathbb , X, ^pright)^ + \left(\mathbb f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>X + Y, ^pright)^ \leqslant \left(\mathbb , X, ^pright)^ + \left(\mathbb f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>X + Y, ^pright)^ \leqslant \left(\mathbb , X, ^pright)^ + \left(\mathbb f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>X + Y, ^pright)^ \leqslant \left(\mathbb , X, ^pright)^ + \left(\mathbb f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>X + Y, ^pright)^ \leqslant \left(\mathbb , X, ^pright)^ + \left(\mathbb f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>X + Y, ^pright)^ \leqslant \left(\mathbb , X, ^pright)^ + \left(\mathbb f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>X + Y, ^pright)^ \leqslant \left(\mathbb , X, ^pright)^ + \left(\mathbb f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>X + Y, ^pright)^ \leqslant \left(\mathbb , X, ^pright)^ + \left(\mathbb f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>X + Y, ^pright)^ \leqslant \left(\mathbb , X, ^pright)^ + \left(\mathbb f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>X + Y, ^pright)^ \leqslant \left(\mathbb , X, ^pright)^ + \left(\mathbb f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>X + Y, ^pright)^ \leqslant \left(\mathbb , X, ^pright)^ + \left(\mathbb f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>X + Y, ^pright)^ \leqslant \left(\mathbb , X, ^pright)^ + \left(\mathbb f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>X + Y, ^pright)^ \leqslant \left(\mathbb , X, ^pright)^ + \left(\mathbb f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>X + Y, ^pright)^ \leqslant \left(\mathbb , X, ^pright)^ + \left(\mathbb f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>X + Y, ^pright)^ \leqslant \left(\mathbb , X, ^pright)^ + \left(\mathbb f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>X + Y, ^pright)^ \leqslant \left(\mathbb , X, ^pright)^ + \left(\mathbb f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>X + Y, ^pright)^ \leqslant \left(\mathbb , X, ^pright)^ + \left(\mathbb f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>X + Y, ^pright)^ \leqslant \left(\mathbb , X, ^pright)^ + \left(\mathbb f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>X + Y, ^pright)^ \leqslant \left(\mathbb , X, ^pright)^ + \left(\mathbb f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>X + Y, ^pright)^ \leqslant \left(\mathbb , X, ^pright)^ + \left(\mathbb f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>X + Y, ^pright)^ \leqslant \left(\mathbb , X, ^pright)^ + \left(\mathbb f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>X + Y, ^pright)^ \leqslant \left(\mathbb , X, ^pright)^ + \left(\mathbb f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>X + Y, ^pright)^ \leqslant \left(\mathbb , X, ^pright)^ + \left(\mathbb f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>X + Y, ^pright)^ \leqslant \left(\mathbb , X, ^pright)^ + \left(\mathbb f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>X + Y, ^pright)^ \leqslant \left(\mathbb , X, ^pright)^ + \left(\mathbb f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>X + Y, ^pright)^ \leqslant \left(\mathbb , X, ^pright)^ + \left(\mathbb f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>X + Y, ^pright)^ \leqslant \left(\mathbb , X, ^pright)^ + \left(\mathbb f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>X + Y, ^pright)^ \leqslant \left(\mathbb , X, ^pright)^ + \left(\mathbb f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>X + Y, ^pright)^ \leqslant \left(\mathbb , X, ^pright)^ + \left(\mathbb f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>X + Y, ^pright)^ \leqslant \left(\mathbb , X, ^pright)^ + \left(\mathbb f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>X + Y, ^pright)^ \leqslant \left(\mathbb , X, ^pright)^ + \left(\mathbb f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>X + Y, ^pright)^ \leqslant \left(\mathbb , X, ^pright)^ + \left(\mathbb f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>X + Y, ^pright)^ \leqslant \left(\mathbb , X, ^pright)^ + \left(\mathbb f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>X + Y, ^pright)^ \leqslant \left(\mathbb , X, ^pright)^ + \left(\mathbb f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>X + Y, ^pright)^ \leqslant \left(\mathbb , X, ^pright)^ + \left(\mathbb f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>X + Y, ^pright)^ \leqslant \left(\mathbb , X, ^pright)^ + \left(\mathbb f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>X + Y, ^pright)^ \leqslant \left(\mathbb , X, ^pright)^ + \left(\mathbb f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>X + Y, ^pright)^ \leqslant \left(\mathbb , X, ^pright)^ + \left(\mathbb f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>X + Y, ^pright)^ \leqslant \left(\mathbb , X, ^pright)^ + \left(\mathbb f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>X + Y, ^pright)^ \leqslant \left(\mathbb , X, ^pright)^ + \left(\mathbb f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>X + Y, ^pright)^ \leqslant \left(\mathbb , X, ^pright)^ + \left(\mathbb f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>X + Y, ^pright)^ \leqslant \left(\mathbb , X, ^pright)^ + \left(\mathbb f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>X + Y, ^pright)^ \leqslant \left(\mathbb , X, ^pright)^ + \left(\mathbb f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>X + Y, ^pright)^ \leqslant \left(\mathbb , X, ^pright)^ + \left(\mathbb f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>X + Y, ^pright)^ \leqslant \left(\mathbb , X, ^pright)^ + \left(\mathbb f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>X + Y, ^pright)^ \leqslant \left(\mathbb , X, ^pright)^ + \left(\mathbb f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>X + Y, ^pright)^ \leqslant \left(\mathbb , X, ^pright)^ + \left(\mathbb[, Y, ^p]\right)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description]">Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description>Y, ^pright)^.


Proof


Proof by Hölder's inequality

First, we prove that f + g has finite p-norm if f and g both do, which follows by , f + g, ^p \leq 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x) = , x, ^p is convex function, convex over \Reals^+ (for p > 1) and so, by the definition of convexity, \left, \tfrac f + \tfrac g\^p \leq \left, \tfrac , f, + \tfrac , g, \^p \leq \tfrac, f, ^p + \tfrac , g, ^p. This means that , f+g, ^p \leq \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 In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality (mathematics), inequality between Lebesgue integration, integrals and an indispensable tool for the study of Lp space, spaces. The numbers an ...
, we find that \begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\leq \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\leq \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.


Proof by a direct convexity argument

Given t \in (0, 1), one has, by convexity ( Jensen's inequality), for every x \in S : , f (x) + g (x), ^p = \Bigl, (1-t) \frac + t \frac \Bigr, ^p \le (1-t) \Bigl, \frac\Bigr, ^p + t \Bigl, \frac \Bigr, ^p = \frac + \frac. By integration this leads to : \int_ , f + g, ^p\, \mathrm\mu \le \frac \int_ , f, ^p\, \mathrm\mu + \frac \int_ , g, ^p\, \mathrm\mu. One takes then : t = \frac to reach the conclusion.


Minkowski's integral inequality

Suppose that (S_1, \mu_1) and (S_2, \mu_2) are two -finite measure spaces and F : S_1 \times S_2 \to \Reals is measurable. Then Minkowski's integral inequality is: \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right ~\leq~ \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx),\quad p\in[1,\infty) with obvious modifications in the case p = \infty. If p > 1, and both sides are finite, then equality holds only if , F(x, y), = \varphi(x) \, \psi(y) a.e. for some non-negative measurable functions \varphi and \psi. If \mu_1 is the counting measure on a two-point set S_1 = \, then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting f_i(y) = F(i, y) for i = 1, 2, the integral inequality gives \, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right)^ \leq \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^ \mu_1(\mathrmx) = \, f_1\, _p + \, f_2\, _p. If the measurable function F : S_1 \times S_2 \to \Reals is non-negative then for all 1 \leq p \leq q \leq \infty, \left\, \left\, F(\,\cdot, s_2)\right\, _\right\, _ ~\leq~ \left\, \left\, F(s_1, \cdot)\right\, _\right\, _ \ . This notation has been generalized to \, f\, _ = \left(\int_ \left[\int_, f(x,y), ^q\mathrmy\right]^ \mathrmx\right)^ for f : \R^ \to E, with \mathcal_(\R^,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 \leq 1, such as the
harmonic mean In mathematics, the harmonic mean is a kind of average, one of the Pythagorean means. It is the most appropriate average for ratios and rate (mathematics), rates such as speeds, and is normally only used for positive arguments. The harmonic mean ...
and the
geometric mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometri ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^p. The generalized inequality has the form \phi^\left(\textstyle\sum\limits_^n \phi(x_i + y_i)\right) \leq \phi^\left(\textstyle\sum\limits_^n \phi(x_i)\right) + \phi^\left(\textstyle\sum\limits_^n \phi(y_i)\right). 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

* * * * *


References

* * * . * . * *


Further reading

* {{Measure theory Articles containing proofs Inequalities (mathematics) Measure theory Lp spaces Articles with short description